package algotithm.leetcode.dp.test64;

/**
 * @author zhouyanxiang
 * @Date 2021-03-2021/3/28-23:54
 * @Title 64. 最小路径和
 */
public class Solution {

    public static void main(String[] args) {
        int[][] grid = {{1,3,1},{1,5,1},{4,2,1}};
        Solution solution = new Solution();
        int pathSum = solution.minPathSum(grid);
        System.out.println(pathSum);
    }

    public int minPathSum(int[][] grid) {
        if (grid.length == 0 || grid == null) {
            return 0;
        }
        int n = grid.length;
        int m = grid[0].length;
        int[][] dp = new int[n][m];
        dp[0][0] = grid[0][0];
        for (int i = 1; i < n; i++) {
            dp[i][0] += dp[i-1][0] + grid[i][0];
        }
        for (int j = 1; j < m; j++) {
            dp[0][j] += dp[0][j-1] + grid[0][j];
        }
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m; j++) {
                dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1]) + grid[i][j];
            }
        }
        return dp[n-1][m-1];
    }
}
